Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers
نویسندگان
چکیده
We consider voting over combinatorial domains, where alternatives are binary tuples. We assume that votes are specified as conditionally lexicographic preferences, or LP trees. We study aggregation problems of LP tree votes for several positional scoring rules. Our main goal is to demonstrate that answer-set programming can be effective in solving the winner and the evaluation problems for instances of practical sizes.
منابع مشابه
Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains
One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters’ preferences are elicited and aggregated. A language usually comes with a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences, where both the relative importance between issues and the preference bet...
متن کاملArrovian Impossibilities in Aggregating Preferences over Sets
Given a society confronting a set of alternatives A, we consider the aggregation of individual preferences over the power set A of A into a social preference over A. In case we allow individuals to have any complete and transitive preference over A, Arrow’s impossibility theorem naturally applies. However, the Arrovian impossibility prevails, even when the set of admissible preferences over A i...
متن کاملAnswer Set Programming and Combinatorial Voting
In this paper Logic Programming with Ordered Disjunction (LPOD), an extension of answer set programming for handling preferences, is used for representing and solving combinatorial vote problems. Various vote rules, used as procedures for determining optimal candidate for a group of voters, are defined by means of preference relations between answer sets of a program, representing a vote proble...
متن کاملFuzzy Answer Set Programming with Literal Preferences
In the current approaches to fuzzy answer set programming (FASP) one can state preferences amongst rules to denote their relative importance. However, in many situations we need more complex preferences such as those in the answer set optimization framework proposed by Brewka for crisp answer set programming. Unfortunately, these complex preferences do not readily fit into the current FASP appr...
متن کاملUsing lexicographic parametric programming for identifying efficient hyperpalnes in DEA
This paper investigates a procedure for identifying all efficient hyperplanes of production possibility set (PPS). This procedure is based on a method which recommended by Pekka J. Korhonen[8]. He offered using of lexicographic parametric programming method for recognizing all efficient units in data envelopment analysis (DEA). In this paper we can find efficient hyperplanes, via using the para...
متن کامل